Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Problème tournée véhicule")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 612

  • Page / 25
Export

Selection :

  • and

The multi-depot periodic vehicle routing problemMINGOZZI, Aristide.Lecture notes in computer science. 2005, pp 347-350, issn 0302-9743, isbn 3-540-27872-9, 4 p.Conference Paper

Minimal load constrained vehicle routing problemsKARA, Imdat; BEKTAS, Tolga.Lecture notes in computer science. 2005, pp 188-195, issn 0302-9743, isbn 3-540-26032-3, 3Vol, 8 p.Conference Paper

Problèmes de tournées avec gains : étude et application au transport inter-usines = Routing problems with profits : Study and application to a freight transportation problemFeillet, Dominique; Dejax, Pierre.2001, 212 p.Thesis

On the reformulation of vehicle routing problems and scheduling problemsBECK, J. Christopher; PROSSER, Patrick; SELENSKY, Evgeny et al.Lecture notes in computer science. 2002, pp 282-289, issn 0302-9743, isbn 3-540-43941-2, 8 p.Conference Paper

A new enhancement of the Clarke and wright savings heuristic for the capacitated vehicle routing problemALTINEL, I. K; ÖNCAN, T.The Journal of the Operational Research Society. 2005, Vol 56, Num 8, pp 954-961, issn 0160-5682, 8 p.Article

The efficacy of exclusive territory assignments to delivery vehicle driversHAUGHTON, Michael A.European journal of operational research. 2007, Vol 184, Num 1, pp 24-38, issn 0377-2217, 15 p.Article

A unified-metaheuristic frameworkOSMAN, I. H.Lecture notes in computer science. 1999, pp 11-12, issn 0302-9743, isbn 3-540-66076-3Conference Paper

Approche polyédrale du problème de tournées de véhicules = Polyhedral approach of the vehicle routing problemAugerat, Philippe; Naddef, D.1995, 139 p.Thesis

Competitive analysis of a dispatch policy for a dynamic multi-period routing problemANGELELLI, Enrico; SAVELSBERGH, Martin W. P; GRAZIA SPERANZA, M et al.Operations research letters. 2007, Vol 35, Num 6, pp 713-721, issn 0167-6377, 9 p.Article

Tabu search variants for the mix fleet vehicle routing problemWASSAN, N. A; OSMAN, I. H.The Journal of the Operational Research Society. 2002, Vol 53, Num 7, pp 768-782, issn 0160-5682Article

Forty Years of Periodic Vehicle RoutingCAMPBELL, Ann Melissa; WILSON, Jill Hardin.Networks (New York, NY). 2014, Vol 63, Num 1, pp 2-15, issn 0028-3045, 14 p.Conference Paper

Pickup and delivery for moving objects on broken linesASAHIRO, Yuichi; MIYANO, Eiji; SHIMOIRISA, Shinichi et al.Lecture notes in computer science. 2005, pp 36-50, issn 0302-9743, isbn 3-540-29106-7, 1Vol, 15 p.Conference Paper

A 2-approximation algorithm for the multi-vehicle scheduling problem on a path with release and handling timesKARUNO, Yoshiyuki; NAGAMOCHI, Hiroshi.Lecture notes in computer science. 2001, pp 218-229, issn 0302-9743, isbn 3-540-42493-8Conference Paper

Special issue on industrial constraint-directed schedulingBECK, J. Christopher; DAVENPORT, A. J; LE PAPE, Claude et al.Constraints (Dordrecht). 2000, Vol 5, Num 4, issn 1383-7133, 97 p.Serial Issue

A new ILP-based refinement heuristic for Vehicle Routing ProblemsDE FRANCESCHI, Roberto; FISCHETTI, Matteo; TOTH, Paolo et al.Mathematical programming. 2006, Vol 105, Num 2-3, pp 471-499, issn 0025-5610, 29 p.Article

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and deliverySUBRAMANIAN, Anand; UCHOA, Eduardo; ALVES PESSOA, Artur et al.Operations research letters. 2011, Vol 39, Num 5, pp 338-341, issn 0167-6377, 4 p.Article

An Inclusion-Exclusion Algorithm for the k-tour ProblemBALUCH, Haseeb; LINGAS, Andrzej.Foundations of computer science. International conferenceWorldComp'2011. 2011, pp 206-208, isbn 1-60132-179-1, 3 p.Conference Paper

Approximations for minimum and min-max vehicle routing problemsARKIN, Esther M; HASSIN, Refael; LEVIN, Asaf et al.Journal of algorithms (Print). 2006, Vol 59, Num 1, pp 1-18, issn 0196-6774, 18 p.Article

Arc routing in a node routing environmentOPPEN, Johan; L OKKETANGEN, Arne.Computers & operations research. 2006, Vol 33, Num 4, pp 1033-1055, issn 0305-0548, 23 p.Article

Formulations and valid inequalities for the heterogeneous vehicle routing problemYAMAN, Hande.Mathematical programming. 2006, Vol 106, Num 2, pp 365-390, issn 0025-5610, 26 p.Article

The multiple traveling salesman problem : an overview of formulations and solution proceduresBEKTAS, Tolga.Omega (Oxford). 2006, Vol 34, Num 3, pp 209-219, issn 0305-0483, 11 p.Article

A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problemCOSLOVICH, Luca; PESENTI, Raffaele; UKOVICH, Walter et al.European journal of operational research. 2006, Vol 175, Num 3, pp 1605-1615, issn 0377-2217, 11 p.Conference Paper

Ant colony system for a dynamic vehicle routing problemMONTEMANNI, R; GAMBARDELLA, L. M; RIZZOLI, A. E et al.Journal of combinatorial optimization. 2005, Vol 10, Num 4, pp 327-343, issn 1382-6905, 17 p.Article

Exact methods based on node-routing formulations for undirected arc-routing problemsBALDACCI, R; MANIEZZO, V.Networks (New York, NY). 2005, Vol 47, Num 1, pp 52-60, issn 0028-3045, 9 p.Article

Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries : Logistics: From theory to applicationNAGY, Gabor; SALHI, Said.European journal of operational research. 2005, Vol 162, Num 1, pp 126-141, issn 0377-2217, 16 p.Conference Paper

  • Page / 25